منابع مشابه
Flash memory efficient LTL model checking
As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based onNAND technology andmuch faster thanmagnetic disks in random reads, while in random writes they are generally not. So far, large-scale LTL model checking algorithms have been designed to employ externa...
متن کاملCuda Accelerated Ltl Model Checking Cuda Accelerated Ltl Model Checking *
Recent technological developments made available various many-core hardware platforms. For example, a SIMD-like hardware architecture became easily accessible for many users who have their computers equipped with modern NVIDIA GPU cards with CUDA technology. In this paper we redesign the maximal accepting predecessors algorithm [7] for LTL model checking in terms of matrix-vector product in ord...
متن کاملLtl Model Checking with I/o-efficient Accepting Cycle Detection Ltl Model Checking with I/o-efficient Accepting Cycle Detection
We show how to adopt existing non-DFS-based algorithm OWCTY [ČP03] for accepting cycle detection to the I/O efficient setting and compare the I/O efficiency and practical performance of the adopted algorithm to the existing I/O efficient LTL model checking approach of Edelkamp et al. [EJ06]. We show that while the new algorithm exhibits similar I/O complexity with respect to the size of the gra...
متن کاملCan Flash Memory Help in Model Checking?
As flash media become common and their capacities and speed grow, they are becoming a practical alternative for standard mechanical drives. So far, external memory model checking algorithms have been optimized for mechanical hard disks corresponding to the model of Aggarwal and Vitter [1]. Since flash memories are essentially different, the model of Aggarwal and Vitter no longer describes their...
متن کاملFrom Distributed Memory Cycle Detection to Parallel LTL Model Checking
In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs back-level edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state distributed memory LTL model checker by extending it with detection of accepting cycles, counterexamp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2011
ISSN: 0167-6423
DOI: 10.1016/j.scico.2010.03.005